program PROB020;
var
  c : array[1..100] of longint;
  p : array[1..100] of integer;
  l, i, j, k, res : integer;
  s : string;

function prime(k : integer) : boolean;
var
  i, c : integer;
begin
  prime := false;
  c := round(sqrt(k));
  for i := 1 to l do
  begin
    if p[i] > c then break;
    if k mod p[i] = 0 then exit;
  end;
  prime := true;
end;

function multi(a : string; b : integer) : string;
var
  i, c, nho : integer;
  res : string;
begin
  res := '';
  nho := 0;
  for i := length(a) downto 1 do
  begin
    c := (ord(a[i])-48)*b + nho;
    nho := c div 10;
    c := c mod 10;
    res := char(c+48)+res;
  end;
  while nho > 0 do
  begin
    res := char(nho mod 10 + 48) + res;
    nho := nho div 10;
  end;
  multi := res;
end;

begin
  l := 0;
  for i := 2 to 100 do
    if prime(i) then
    begin
      inc(l);
      p[l] := i;
    end;
  for i := 1 to 100 do
  begin
    k := i;
    for j := 1 to l do
      while k mod p[j] = 0 do
      begin
        inc(c[j]);
        k := k div p[j];
      end;
  end;
  dec(c[1], c[3]);
  c[3] := 0;
  s := '1';
  for i := 1 to l do
  begin
    for j := 1 to c[i] do s := multi(s, p[i]);
  end;
  res := 0;
  for i := 1 to length(s) do res := res + ord(s[i]) - 48;
  writeln(res);
end.